package LeetCode.LeetCode2;

/**
 * 最长递增子序列
 * @author lumin
 * @date 2022/04/16 20:07
 **/
public class Num300 {
    public int lengthOfLIS(int[] nums) {
        int i = 1;
        int maxLength = 0;
        while(i < nums.length){
            if(nums[i - 1] < nums[i]){
                maxLength++;
            }
            i++;
        }
        return maxLength;
    }
}